Statistical Inference for Probabilistic Constraint Logic Programming

نویسنده

  • Stefan Riezler
چکیده

Most approaches to probabilistic logic programming deal with deduction systems and xpoint semantics for programming systems with user-speci ed weights attached to the formulae of the language, i.e, the aim is to connect logical inference and probabilistic inference. However, such a user-speci c determination of weights is not reusable and often complex. In various applications, automatic methods to estimate weights from empirical data are desirable. This leads to a completely di erent approach to probabilistic logic programming, where the central problem is a speci cation of a probability distribution over the answers of the system and the use of statistical methods to estimate the probabilistic parameters from data. In this paper we present a probabilistic model for constraint logic programming, coupled with an algorithm for statistical inference about the parameters of such probabilistic models from incomplete data. The probability model we use is a powerful log-linear probability distribution over the proof trees that a program yields for a sample of queries. The statistical parameter estimation method we present is an extension of the improved iterative scaling algorithm of Della Pietra, Della Pietra, and La erty (1997) to incomplete data. This extension obviates the need to rely on large samples of analyses of the system for training. In addition, we provide an algorithm for search for most probable proof trees based upon the method of Viterbi (1967). This enables to nd the most probable answer of a query e ciently.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic constraint logic programming: formal foundations of quantitative and statistical inference in constrained based natural language processing

Structural ambiguity in linguistic analyses is a severe problem for natural language processing. For grammars describing a nontrivial fragment of natural language, every input of reasonable length may receive a large number of analyses, many of which are implausible or spurious. This problem is even harder for highly complex constraint-based grammars. Whereas the mathematical foundation of such...

متن کامل

Inference for a New Probabilistic Constraint Logic

Probabilistic logics combine the expressive power of logic with the ability to reason with uncertainty. Several probabilistic logic languages have been proposed in the past, each of them with their own features. In this paper, we propose a new probabilistic constraint logic programming language, which combines constraint logic programming with probabilistic reasoning. The language supports mode...

متن کامل

Probabilistic Programming : Concepts and Challenges ( Extended Abstract ) Angelika Kimmig and Luc

A multitude of different probabilistic programming languages exists today, all extending a traditional programming language with primitives to support modeling of and reasoning with complex, structured probability distributions. Examples include functional languages (Church [Goodman et al., 2008], IBAL [Pfeffer, 2001]), object-oriented languages (Figaro [Pfeffer, 2009]), and logic languages (Pr...

متن کامل

Statistical Inference and Probabilistic Modelling for Constraint-Based NLP

In this paper we present a probabilistic model for constraint-based grammars and a method for estimating the parameters of such models from incomplete, i.e., unparsed data. Whereas methods exist to estimate the parameters of probabilistic context-free grammars from incomplete data ([2]), so far for probabilistic grammars involving context-dependencies only parameter estimation techniques from c...

متن کامل

CHRiSM: Chance Rules induce Statistical Models

A new probabilistic-logic formalism, called CHRiSM, is introduced. CHRiSM is based on a combination of CHR and PRISM. It can be used for high-level rapid prototyping of complex statistical models by means of chance rules. The underlying PRISM system can then be used for several probabilistic inference tasks, including parameter learning. We describe a source-to-source transformation from CHRiSM...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998